Personality Analysis Using Classification on Turkish Tweets

According to the psychology literature, there is a strong correlation between personality traits and the linguistic behavior of people. Due to the increase in computer based communication, individuals express their personalities in written forms on social media. Hence, social media has become a convenient resource to analyze the relationship between personality traits and lingusitic behaviour. Although there is a vast amount of studies on social media, only a small number of them focus on personality prediction. In this work, the authors aim to model the relationship between the social media messages of individuals and big five personality traits as a supervised learning problem. They use Twitter posts and user statistics for analysis. They investigate various approaches for user profile representation, explore several supervised learning techniques, and present comparative analysis results. The results confirm the findings of psychology literature, and they show that computational analysis of tweets using supervised learning methods can be used to determine the personality of individuals

Design and implementation of an object-oriented expert system shell

Ankara : The Department of Computer Engineering and Information Sciences and the Institute of Engineering and Science of Bilkent Univ. , 1989.Thesis (Master's) -- Bilkent University, 1989.Includes bibliographical references leaves 50-53.Expert systems represent a new opportunity in computing. An expert system is a computing system capable of representing and reasoning about some knowledge-rich domain with a view to solving problems and giving advice. Expert system shells are developed to create expert systems in an easy way. In recent years the object-oriented paradigm has been developed. The objectoriented approach has many advantages such as data abstraction, program modularity, and structural data representation. Therefore, we are developing an expert system shell which stores knowledge and data in object-oriented style. Also, an object-oriented DBMS part of our shell satisfy the needs of several expert systems rec|uiring large base of fcvcts. Such shells can be used to build expert systems by only adding the domain-specific knowledge.Toroslu, İsmail HakkıM.S

An expandable approach for design and personalization of digital, just-in-time adaptive interventions

Objective: We aim to deliver a framework with 2 main objectives: 1) facilitating the design of theory-driven, adaptive, digital interventions addressing chronic illnesses or health problems and 2) producing personalized intervention delivery strategies to support self-management by optimizing various intervention components tailored to people's individual needs, momentary contexts, and psychosocial variables

Repetition support and mining cyclic patterns

For customer transaction database, the support (customer support) of the sequential pattern is defined as the fraction of the customers supporting the sequence. We define new forms of the mining patterns, called cyclic patterns, as an extension to the sequential pattern mining by introducing a new parameter, the repetition support. For customer transaction database, the repetition support specifies the minimum number of repetitions of the patterns in each customer transaction sequence. Repeated patterns can also be viewed as cyclic since the beginning of a sequence will follow the end of the previous occurrence of the same sequence. In this paper, we introduce the repetition support parameter, the cyclic pattern mining problem, describe the related algorithms, and at the end of the paper we give some performance results

LPL++: Object logic programming language with built-in inheritance through unification

In this paper, an object logic programming language is proposed that captures ail of the basic object-oriented concepts in standard logic programming environment. This paper combines and extends two previously proposed models, namely Conery's technique (1988) which uses first-order logic to model objects including all of the basic object-oriented concepts except inheritance, and the LOGIN language of Ait-Kaci and Nasr (1986) which embeds inheritance into unification using typed logic

Personnel assignment problem with hierarchical ordering constraints

In the standard assignment problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard assignment problem, having some ordering constraints on the partitions of the bipartite graph. We call this problem as 'assignment problem with hierarchical ordering constraint' (APHOC). As its name implies, hierarchical constraints are introduced on both partitions, and, the matching between the partitions should respect these hierarchical ordering constraints. A natural version of such constraints occurs in personnel assignment problem, where one of the partitions is a level graph representing the ranks of personnel, and the other one is a forest, representing the positions. We will first show that this problem is NP-complete. Then, we will investigate some heuristic and approximate solutions. Finally, we will study the performances of these solutions

New transitive closure algorithm for recursive query processing in deductive databases

© 1992 IEEE.The development of effic1.e11t algorithms to process the different forms of the transitive-closure (TC) queries within the context of large database systems has recently attracted a large amom1t of research efforts. In this paper, we present a neic algorithm suitable for full transitive closure problem, which zs used to solve uninstentiated recursive qi1enes in deductive databases. In this new algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one where all of the page I/ 0 operations are minimized. Using szmulatwn, this paper also studies and examines the performance of thzs algorithm and compares it with the pruiovs algorithms

A genetic algorithm for maximum-weighted tree matching problem

In hierarchal organizations, for assigning tasks to the divisions of the organization some constraints must be satisfied. This article investigates one such problem in which there are k different tasks to be accomplished and each division's performance on each task may be different and represented by a scalar value. In this article we formally introduce this real life decision problem, named as Maximum-Weighted Tree Matching Problem, and propose a genetic algorithm solution to it, and give some experimental results. (C) 2009 Elsevier B. V. All rights reserved

Effective maintenance views: Improvements to the DRed algorithm

In this paper, one of the most recent promising algorithms that compute changes to recursive structures in response to changes to the extensional database (EDB) relations (i.e. DRed algorithm) has been studied and it has been improved. In the improved algorithm, the computation has been further ''incrementalized'' in comparison to DRed algorithm using extra intra-iteration computations in each phase. Also, both of the algorithms have been implemented in a testbed to study their performance through simulations

An architecture for workflow scheduling under resource allocation constraints

Research on specification and scheduling of workflows has concentrated on temporal and causality constraints, which specify existence and order dependencies among tasks. However, another set of constraints that specify resource allocation is also equally important. The resources in a workflow environment are agents such as person, machine, software, etc. that execute the task. Execution of a task has a cost and this may vary depending on the resources allocated in order to execute that task. Resource allocation constraints define restrictions on how to allocate resources, and scheduling under resource allocation constraints provide proper resource allocation to tasks. In this work, we provide an architecture to specify and to schedule workflows under resource allocation constraints as well as under the temporal and causality constraints. A specification language with the ability to express resources and resource allocation constraints and a scheduler module that contains a constraint solver in order to find correct resource assignments are core and novel parts of this architecture